Enumerative Properties of Rooted Circuit Maps
نویسندگان
چکیده
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for studying some graph-theoretic properties. In this paper, we study some enumerative properties of circuit graphs. For enumeration purpose, we define rooted circuit maps and compare the number of rooted circuit maps with those of rooted 2-connected planar maps and rooted 3-connected planar maps.
منابع مشابه
Enumeration of eulerian and unicursal planar maps
Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...
متن کاملGuessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System
We present a theorem-proving experiment performed with a computer algebra system. It proves a conjecture about the general pattern of the generating functions counting rooted maps of given genus. These functions are characterized by a complex non-linear differential system between generating functions of multi-rooted maps. Establishing a pattern for these functions requires a sophisticated indu...
متن کاملLeft ternary trees and non-separable rooted planar maps
In this paper, we illustrate a bijective proof of the enumerative formula regarding non-separable rooted planar maps N S, by means of a class L of certain ternary trees (called left trees). Our rst step consists in determining the left trees' combinatorial enumeration according to the number of their internal nodes. We then establish a bijection between the left trees having n internal nodes an...
متن کاملEnumerative Formulae for Unrooted Planar Maps: a Pattern
We present uniformly available simple enumerative formulae for unrooted planar n-edge maps (counted up to orientation-preserving isomorphism) of numerous classes including arbitrary, loopless, non-separable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect to the terms of the sum over t | n, t < n. Namely, these terms, which correspond to non-trivial aut...
متن کاملTransversality Properties on the Moduli Space of Genus 0 Stable Maps to a Smooth Rational Projective Surface and Their Real Enumerative Implications
We characterize transversality, non-transversality properties on the moduli space of genus 0 stable maps to a rational projective surface. This characterization is based on the singularity analysis of the product of evaluation maps and deformation properties of the pointed stable maps. If a target space is equipped with a real structure, i.e, anti-holomorphic involution, then this transversalit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 26 شماره
صفحات -
تاریخ انتشار 2010